Normalized Entity Graph for Computing Local Coherence
نویسندگان
چکیده
Guinaudeau and Strube (2013) introduce a graph based model to compute local entity coherence. We propose a computationally efficient normalization method for these graphs and then evaluate it on three tasks: sentence ordering, summary coherence rating and readability assessment. In all tasks normalization improves the results.
منابع مشابه
An Optimal Approach to Local and Global Text Coherence Evaluation Combining Entity-based, Graph-based and Entropy-based Approaches
Text coherence evaluation becomes a vital and lovely task in Natural Language Processing subfields, such as text summarization, question answering, text generation and machine translation. Existing methods like entity-based and graph-based models are engaging with nouns and noun phrases change role in sequential sentences within short part of a text. They even have limitations in global coheren...
متن کاملA Novel Two-stage Framework for Extracting Opinionated Sentences from News Articles Conference Program a Novel Two-stage Framework for Extracting Opinionated Sentences from News Articles Normalized Entity Graph for Computing Local Coherence
Guinaudeau and Strube (2013) introduce a graph based model to compute local entity coherence. We propose a computationally efficient normalization method for these graphs and then evaluate it on three tasks: sentence ordering, summary coherence rating and readability assessment. In all tasks normalization improves the results.
متن کاملGraph-based Local Coherence Modeling
We propose a computationally efficient graph-based approach for local coherence modeling. We evaluate our system on three tasks: sentence ordering, summary coherence rating and readability assessment. The performance is comparable to entity grid based approaches though these rely on a computationally expensive training phase and face data sparsity problems.
متن کاملCollective List-only Entity Linking: A Graph-based Approach
List-only entity linking is the task of mapping ambiguous mentions in texts to target 8 entities in a group of entity lists. Different from traditional entity linking task, which leverages rich 9 semantic relatedness in knowledge bases to improve linking accuracy, list-only entity linking can 10 merely take advantage of co-occurrences information in entity lists. State-of-the-art work utilizes ...
متن کاملFundamental Limitations of Spectral Clustering
Spectral clustering methods are common graph-based approaches to clustering of data. Spectral clustering algorithms typically start from local information encoded in a weighted graph on the data and cluster according to the global eigenvectors of the corresponding (normalized) similarity matrix. One contribution of this paper is to present fundamental limitations of this general local to global...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014